The Diophantine Equation x 4 + 2 y 4 = z 4 + 4 w 4 — a number of improvements

نویسنده

  • Jörg Jahnel
چکیده

The quadruple (1 484 801, 1 203 120, 1 169 407, 1 157 520) already known is essentially the only non-trivial solution of the Diophantine equation x4 + 2y4 = z4 + 4w4 for |x|, |y|, |z|, and |w| up to one hundred million. We describe the algorithm we used in order to establish this result, thereby explaining a number of improvements to our original approach [EJ].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Exponential Diophantine Equation ( 4 m 2 + 1

Let m be a positive integer. Then we show that the exponential Diophantine equation (4m2 + 1)x + (5m2 − 1)y = (3m)z has only the positive integer solution (x, y, z) = (1, 1, 2) under some conditions. The proof is based on elementary methods and Baker’s method. Mathematics Subject Classification: 11D61

متن کامل

Complete solutions of a family of quartic

Continuing the recent work of the second author, we prove that the diophantine equation fa(x; y) = x 4 ? ax 3 y ? x 2 y 2 + axy 3 + y 4 = 1 for jaj 3 has exactly 12 solutions except when jaj = 4, when it has 16 solutions. If = (a) denotes one of the zeros of fa(x; 1), then for jaj 4 we also nd all 2 Z Z] with Z Z] = Z Z].

متن کامل

On the Diophantine Equation x^6+ky^3=z^6+kw^3

Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...

متن کامل

Modular congruences, Q-curves, and the diophantine equation x 4 + y 4 = z p , preprint; available at: http://www.math.leidenuniv.nl/gtem/view.php (preprint 55

We prove two results concerning the generalized Fermat equation x 4 + y4 = z. In particular we prove that the First Case is true if p 6= 7.

متن کامل

Diophantine Equations Related with Linear Binary Recurrences

In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005